Sequential Halving for Partially Observable Games
نویسندگان
چکیده
This paper investigates Sequential Halving as a selection policy in the following four partially observable games: Go Fish, Lost Cities, Phantom Domineering, and Phantom Go. Additionally, H-MCTS is studied, which uses Sequential Halving at the root of the search tree, and UCB elsewhere. Experimental results reveal that H-MCTS performs the best in Go Fish, whereas its performance is on par in Lost Cities and Phantom Domineering. Sequential Halving as a at Monte-Carlo Search appears to be the stronger technique in Phantom Go.
منابع مشابه
Exploiting Agent and Type Independence in Collaborative Graphical Bayesian Games
Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such problems can be modeled as collaborative Bayesian games in which each agent receives private information in the form of its type. However, representing and solving...
متن کاملLearning to Act Optimally in Partially Observable Multiagent Settings: (Doctoral Consortium)
My research is focused on modeling optimal decision making in partially observable multiagent environments. I began with an investigation into the cognitive biases that induce subnormative behavior in humans playing games online in multiagent settings, leveraging well-known computational psychology approaches in modeling humans playing a strategic, sequential game. My subsequent work was in a s...
متن کاملFiltered Fictitious Play for Perturbed Observation Potential Games and Decentralised POMDPs
Potential games and decentralised partially observable MDPs (Dec–POMDPs) are two commonly used models of multi–agent interaction, for static optimisation and sequential decision– making settings, respectively. In this paper we introduce filtered fictitious play for solving repeated potential games in which each player’s observations of others’ actions are perturbed by random noise, and use this...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملStructure in the value function of zero-sum games of incomplete information
In this paper, we introduce plan-time sufficient statistics, representing probability distributions over joint sets of private information, for zero-sum games of incomplete information. We define a family of zero-sum Bayesian Games (zs-BGs), of which the members share all elements but the plan-time statistic. Using the fact that the statistic can be decomposed into a marginal and a conditional ...
متن کامل